MATHEMATICAL ENGINEERING TECHNICAL REPORTS Efficient Implementation of Tree Skeletons on Distributed-Memory Parallel Computers
نویسندگان
چکیده
Parallel tree skeletons are basic computational patterns that encourage us to develop parallel programs manipulating trees. In this paper, we develop an efficient implementation of parallel tree skeletons on distributed-memory parallel computers. In our implementation, we divide a binary tree based on the idea of m-bridges to obtain high locality, and represent local segments as serialized arrays to obtain high sequential performance. We furthermore develop a cost model of our implementation of parallel tree skeletons. We confirmed the efficacy of our implementation with several experiments.
منابع مشابه
Efficient Implementation of Tree Skeletons on Distributed-Memory Parallel Computers
Parallel tree skeletons are basic computational patterns that can be used to develop parallel programs for manipulating trees. In this paper, we propose an efficient implementation of parallel tree skeletons on distributed-memory parallel computers. In our implementation, we divide a binary tree to segments based on the idea of m-bridges with high locality, and represent local segments as seria...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Design and Implementation of General Tree Skeletons
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficient parallel programs manipulating trees of arbitrary shapes, because of their irregular and ill-balanced structures. In this paper, we propose a solution for them based on the skeletal approach, in particular for genera...
متن کاملImplementation of Parallel Tree Skeletons on Distributed Systems
Trees are useful data types, but developing efficient parallel programs manipulating trees is known to be difficult, because of their irregular and imbalance structure. Parallel tree skeletons are designed to ease parallel programming by encouraging programmers to build parallel programs by combining them. However, for distributed systems, efficient implementations of these parallel tree skelet...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Parallelization with Tree Skeletons
Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tree skeletons have been proposed to simplify parallel programming on trees, few studies have been reported on how to systematically use them in solving practical problems; it is neither clear how to make a good combination of ske...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS A Practicable Framework for Tree Reductions under Distributed Memory Environments
Besides intensive research toward matrices or one dimensional arrays, another important data structure, namely trees, are calling for efficient parallel treatments. Parallel tree contractions are fundamental to realize efficient computation over the inherently imbalanced structures. However, we sometimes fail to practically benefit from the techniques under current computer architectures. This ...
متن کامل